mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-31 09:43:11 +08:00
27 lines
1.1 KiB
HTML
27 lines
1.1 KiB
HTML
<p>Given an array of points on the <strong>X-Y</strong> plane <code>points</code> where <code>points[i] = [x<sub>i</sub>, y<sub>i</sub>]</code>, return <em>the area of the largest triangle that can be formed by any three different points</em>. Answers within <code>10<sup>-5</sup></code> of the actual answer will be accepted.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/04/04/1027.png" style="height: 369px; width: 450px;" />
|
|
<pre>
|
|
<strong>Input:</strong> points = [[0,0],[0,1],[1,0],[0,2],[2,0]]
|
|
<strong>Output:</strong> 2.00000
|
|
<strong>Explanation:</strong> The five points are shown in the above figure. The red triangle is the largest.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> points = [[1,0],[0,0],[0,1]]
|
|
<strong>Output:</strong> 0.50000
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>3 <= points.length <= 50</code></li>
|
|
<li><code>-50 <= x<sub>i</sub>, y<sub>i</sub> <= 50</code></li>
|
|
<li>All the given points are <strong>unique</strong>.</li>
|
|
</ul>
|